Lambda-dropping: transforming recursive equations into programs with block structure
نویسندگان
چکیده
منابع مشابه
Lambda - Dropping : Transforming Recursive Equations into Programswith Block
Lambda-lifting a functional program transforms it into a set of recursive equations. We present the symmetric transformation: lambda-dropping. Lambda-dropping a set of recur-sive equations restores block structure and lexical scope. For lack of scope, recursive equations must carry around all the parameters that any of their callees might possibly need. Both lambda-lifting and lambda-dropping t...
متن کاملTransforming Programs into Recursive Functions
This paper presents a new proof-assistant based approach to program verification: programs are translated, via fully-automatic deduction, into tail-recursive function defined in the logic of a theorem prover. This approach improves on well-established methods based on Hoare logic and verification condition generation (VCG) by removing the need to annotate programs with assertions, making the pr...
متن کاملLambda Lifting: Treansforming Programs to Recursive Equations
y Abstract Lambda lifting is a technique for transforming a functional program with local function deenitions, possibly with free variables in the function deenitions, into a program consisting only of global function (combinator) deenitions which will be used as rewrite rules. Diierent ways of doing lambda lifting are presented, as well as reasons for rejecting or selecting the method used in ...
متن کاملAn Extensional Characterization of Lambda-Lifting and Lambda-Dropping
Lambda-lifting and lambda-dropping respectively transform a blockstructured functional program into recursive equations and vice versa. Lambda-lifting was developed in the early 80’s, whereas lambda-dropping is more recent. Both are split into an analysis and a transformation. Published work, however, has only concentrated on the analysis parts. We focus here on the transformation parts and mor...
متن کاملTransforming Specifications of Observable Behaviour into Programs
A methodology for deriving programs from specifications of observable behaviour is described. The class of processes to which this methodology is applicable includes those whose state changes are fully definable by labelled transition systems, for example communicating processes without internal state changes. A logic program representation of such labelled transition systems is proposed, inter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00054-2